initial vertex

См. также в других словарях:

• Initial and terminal objects — Terminal element redirects here. For the project management concept, see work breakdown structure. In category theory, an abstract branch of mathematics, an initial object of a category C is an object I in C such that for every object X in C,… …   Wikipedia

• initial line — noun : a ray that is rotated about the vertex to make an angle …   Useful english dictionary

• Bass–Serre theory — is a part of the mathematical subject of group theory that deals with analyzing the algebraic structure of groups acting by automorphisms on simplicial trees. The theory relates group actions on trees with decomposing groups as iterated… …   Wikipedia

• Configuration graph — Configuration graphs are a theoretical tool used in computational complexity theory to prove a relation between graph reachability and complexity classes. Contents 1 Definition 2 Useful property 3 Use of this object …   Wikipedia

• Grushko theorem — In the mathematical subject of group theory, the Grushko theorem or the Grushko Neumann theorem is a theorem stating that the rank (that is, the smallest cardinality of a generating set) of a free product of two groups is equal to the sum of the… …   Wikipedia

• Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… …   Wikipedia

• Graph drawing — This article is about the general subject of graph drawing. For the annual research symposium, see International Symposium on Graph Drawing. Graphic representation of a minute fraction of the WWW, demonstrating hyperlinks. Graph drawing is an… …   Wikipedia

• начальная вершина — — [Л.Г.Суменко. Англо русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.] Тематики информационные технологии в целом EN initial vertex …   Справочник технического переводчика

• Feynman diagram — The Wick s expansion of the integrand gives (among others) the following termNarpsi(x)gamma^mupsi(x)arpsi(x )gamma^ upsi(x )underline{A mu(x)A u(x )};,whereunderline{A mu(x)A u(x )}=int{d^4pover(2pi)^4}{ig {mu u}over k^2+i0}e^{ k(x x )}is the… …   Wikipedia

• Dijkstra's algorithm — Not to be confused with Dykstra s projection algorithm. Dijkstra s algorithm Dijkstra s algorithm runtime Class Search algorithm Data structure Graph Worst case performance …   Wikipedia

• Algorithmics of sudoku — The class of Sudoku puzzles consists of a partially completed row column grid of cells partitioned into N regions or zones each of size N cells, to be filled in using a prescribed set of N distinct symbols (typically the numbers {1, ..., N }), so …   Wikipedia